Using The Meta-Raps Approach To Solve Combinatorial Problems
نویسندگان
چکیده
This paper introduces an interesting meta-heuristic called Meta-RaPS (Meta-heuristic for Randomized Priority Search) for solving combinatorial problems . Meta-RaPS incorporates randomness within priority rules to construct a feasible solution at each iteration. In addition, Meta-RaPS includes improvement heuristics for enhancing the feasible solution already obtained. Applications discussed include: Traveling Salesman Problem, Resource Constrained Project Scheduling Problem, and Knapsack Problem.
منابع مشابه
A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملEmploying Learning to Improve the Performance of Meta-RaPS
In their search for satisfactory solutions to complex combinatorial problems, metaheuristics methods are expected to intelligently explore the solution space. Various forms of memory have been used to achieve this goal and improve the performance of metaheuristics, which warranted the development of the Adaptive Memory Programming (AMP) framework [1]. This paper follows this framework by integr...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کامل